/*
 *  This file is part of WWWPal.
 *
 *  Copyright (C) 2003  Dr. John Punin, Department of Computer Science
 *  Rensselaer Polytechnic Institute
 *
 *  WWWPal is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  WWWPal is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with Foobar; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

#define MAX_TREE  15 /* 15 */
#define MIN_NODES 15   /* 30 */

int
first_partition_algorithm(mainFrame *mf, int mn, int mt, char rep);
char *
select_and_group(mainFrame *mf,tgrFrame *tgf, tgrFrame *maptgf);

int
select_best_nodes(mainFrame *mf, tgrFrame *tgf);
char *
create_new_name(mainFrame *mf);

tgrFrame *
create_directed_graph(mainFrame *mf);
void
add_node_to_map(mainFrame *mf,tgrFrame *tgf,tgrFrame *maptgf);

int
erase_frame(mainFrame *mf, tgrFrame *tgf);
void
move_cur_to_tgf(mainFrame *mf, tgrFrame *tgf);


